An E cient Out - of - Core Algorithm for ImplicitTime - Stepping Schemes in One
نویسنده
چکیده
This paper describes an eecient out-of-core algorithm for implicit time stepping schemes in one dimension. The algorithm can achieve a reduction in the amount of I/O over a conventional algorithm by a factor of maxf p M ; minfM;M 2 =ngg where M is the size of primary memory and n is the size of the state vector. We have implemented the algorithm and found it to be more than 5 times faster than a conventional algorithm on a workstation when the problem does not t into the workstation's primary memory. In numerical experiments, the algorithm exhibited good numerical stability.
منابع مشابه
An efficient algorithm for finding the semi-obnoxious $(k,l)$-core of a tree
In this paper we study finding the $(k,l)$-core problem on a tree which the vertices have positive or negative weights. Let $T=(V,E)$ be a tree. The $(k,l)$-core of $T$ is a subtree with at most $k$ leaves and with a diameter of at most $l$ which the sum of the weighted distances from all vertices to this subtree is minimized. We show that, when the sum of the weights of vertices is negative, t...
متن کاملA General Solution for Implicit Time Stepping Scheme in Rate-dependant Plasticity
In this paper the derivation of the second differentiation of a general yield surface implicit time stepping method along with its consistent elastic-plastic modulus is studied. Moreover, the explicit, trapezoidal implicit and fully implicit time stepping schemes are compared in rate-dependant plasticity. It is shown that implementing fully implicit time stepping scheme in rate-dependant plasti...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملبهبود پایداری شبکه قدرت با روش جدید حذف بار ترکیبی
Power system blackouts have become a serious problem for electric utilities especially in recent years. Different forms of system instability have emerged in recent blackouts, such as voltage instability and frequency instability. To counteract each form of system instability, special algorithms have been designed in the protection system, e.g. Under Frequency Load Shedding (UFLS) and Under Vol...
متن کاملIdentifying Flow Units Using an Artificial Neural Network Approach Optimized by the Imperialist Competitive Algorithm
The spatial distribution of petrophysical properties within the reservoirs is one of the most important factors in reservoir characterization. Flow units are the continuous body over a specific reservoir volume within which the geological and petrophysical properties are the same. Accordingly, an accurate prediction of flow units is a major task to achieve a reliable petrophysical description o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007